- well ordering set
- вполне упорядочивающее множество
English-Russian scientific dictionary. 2008.
well ordering set
Смотреть что такое "well ordering set" в других словарях:
Well-ordering theorem — The well ordering theorem (not to be confused with the well ordering axiom) states that every set can be well ordered.This is important because it makes every set susceptible to the powerful technique of transfinite induction.Georg Cantor… … Wikipedia
Well-ordering principle — In mathematics, the well ordering principle states that every non empty set of positive integers contains a smallest element. [cite book |title=Introduction to Analytic Number Theory |last=Apostol |first=Tom |authorlink=Tom M. Apostol |year=1976… … Wikipedia
well-ordering theorem — /wel awr deuhr ing/, Math. the theorem of set theory that every set can be made a well ordered set. * * * … Universalium
well-ordering theorem — /wel awr deuhr ing/, Math. the theorem of set theory that every set can be made a well ordered set … Useful english dictionary
Well-order — In mathematics, a well order relation (or well ordering) on a set S is a total order on S with the property that every non empty subset of S has a least element in this ordering.Equivalently, a well ordering is a well founded total order.The set… … Wikipedia
set theory — the branch of mathematics that deals with relations between sets. [1940 45] * * * Branch of mathematics that deals with the properties of sets. It is most valuable as applied to other areas of mathematics, which borrow from and adapt its… … Universalium
Well-founded relation — In mathematics, a binary relation, R, is well founded (or wellfounded) on a class X if and only if every non empty subset of X has a minimal element with respect to R; that is, for every non empty subset S of X, there is an element m of S such… … Wikipedia
ordering relation — A partial ordering on a set is a relation < that is transitive and reflexive and antisymmetric. That is, (i) x < y & y < z →x < z ; (ii) x < x ; (iii) x < y & y < x →x = y . If we add (iv) that at least one of x < y, x = y … Philosophy dictionary
well-order — 1. noun A total order of which every nonempty subset has a least element. Syn: well ordering 2. verb To impose a well order on (a set) … Wiktionary
Well-quasi-ordering — In mathematics, specifically order theory, a well quasi ordering or wqo is a well founded quasi ordering with an additional restriction on sequences that there is no infinite sequence x i with x i ot le x j for all i < j . Motivation We can use… … Wikipedia
Set theory (music) — Example of Z relation on two pitch sets analyzable as or derivable from Z17 (Schuijer 2008, p.99), with intervals between pitch classes labeled for ease of comparison between the two sets and their common interval vector, 212320. Musical set… … Wikipedia
